Choice Logic Programs and Nash Equilibria in Strategic Games
نویسندگان
چکیده
We define choice logic programs as negation-free datalog programs that allow rules to have exclusive-only disjunctions in the head. We show that choice programs are equivalent to semi-negative datalog programs, at least as far as stable models are concerned. We also discuss an application where strategic games can be naturally formulated as choice programs; it turns out that the stable models of such programs capture exactly the set of Nash equilibria.
منابع مشابه
Vrije Universiteit Brussel Faculteit Wetenschappen Vakgroep Informatica E J I R V S C I E N U T N I a V
In this dissertation we investigate logic programming to model decision-making. To this extent, we introduce three formalisms with increasing expressiveness. The most basic one, called choice logic programming, allows circumstance-dependent decisions. The stable models of the program correspond to the rational solutions of the represented decision-problem. To support dynamic preference-based de...
متن کاملOn the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally model decision problems where, depending on a context, agents must make a decision, i.e. an exclusive choice out of several alternatives. It is shown that such a choice mechanism is in a sense equivalent with negation as ...
متن کاملStrategic behavior in non-atomic games ¬リニ
In order to remedy the possible loss of strategic interaction in non-atomic games with a societal choice, this study proposes a refinement of Nash equilibrium, strategic equilibrium. Given a non-atomic game, its perturbed game is one in which every player believes that he alone has a small, but positive, impact on the societal choice; and a strategy is a strategic equilibrium if it is a limit p...
متن کاملLinear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications
In recent work, semantic games of independence-friendly logic were studied in strategic form in terms of (mixed strategy) Nash equilibria. The class of strategic games of independence-friendly logic is contained in the class of win-loss, zero-sum two-player games. In this note we draw on the theory of linear programming to develop tools to analyze the value of such games. We give two applicatio...
متن کاملExpresiveness and Complexity Results for Strategic Reasoning
This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Our results are based on a novel approach to the characterisation of equilibria in such games: a semantic characterisation based on winning stra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999